TSTP Solution File: GRA028^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GRA028^1 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 05:43:27 EDT 2024
% Result : Theorem 1.64s 0.57s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 57
% Number of leaves : 10
% Syntax : Number of formulae : 96 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 1468 ( 751 equ; 4 cnn)
% Maximal formula atoms : 46 ( 15 avg)
% Number of connectives : 1639 ( 172 ~; 622 |; 107 &; 723 @)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 13 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 429 ( 429 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 459 ( 33 ^ 371 !; 54 ?; 459 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_3,type,
sK0: ( $o > $o ) > ( $o > $o ) > $o ).
thf(func_def_9,type,
ph2:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
sK3: $o > $o ).
thf(f754,plain,
$false,
inference(avatar_sat_refutation,[],[f520,f593,f601,f639,f753]) ).
thf(f753,plain,
( spl1_2
| spl1_2
| spl1_4
| ~ spl1_11 ),
inference(avatar_split_clause,[],[f723,f637,f514,f507,f507]) ).
thf(f507,plain,
( spl1_2
<=> ! [X1: $o] : ( $false = X1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
thf(f514,plain,
( spl1_4
<=> ! [X1: $o] : ( $true = X1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
thf(f637,plain,
( spl1_11
<=> ! [X2: $o > $o,X3: $o,X4: $o] :
( ( ( ^ [Y0: $o] : $false )
= X2 )
| ( $false = X4 )
| ( ( X2 @ X3 )
= $true )
| ( ( X2 @ X4 )
= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_11])]) ).
thf(f723,plain,
( ! [X2: $o,X0: $o,X1: $o] :
( ( $false = X2 )
| ( $true = X1 )
| ( $false = X0 ) )
| ~ spl1_11 ),
inference(duplicate_literal_removal,[],[f721]) ).
thf(f721,plain,
( ! [X2: $o,X0: $o,X1: $o] :
( ( $false = X2 )
| ( $false = X0 )
| ( $true = X1 )
| ( $true = X1 ) )
| ~ spl1_11 ),
inference(binary_proxy_clausification,[],[f720]) ).
thf(f720,plain,
( ! [X2: $o,X0: $o,X1: $o] :
( ( $true = X1 )
| ( $false = X0 )
| ( X1 = X2 ) )
| ~ spl1_11 ),
inference(equality_proxy_clausification,[],[f719]) ).
thf(f719,plain,
( ! [X2: $o,X0: $o,X1: $o] :
( ( $true
= ( X1 = X2 ) )
| ( $false = X0 )
| ( $true = X1 ) )
| ~ spl1_11 ),
inference(duplicate_literal_removal,[],[f718]) ).
thf(f718,plain,
( ! [X2: $o,X0: $o,X1: $o] :
( ( $true = X1 )
| ( $true
= ( X1 = X2 ) )
| ( $false = X0 )
| ( $false = X0 ) )
| ~ spl1_11 ),
inference(binary_proxy_clausification,[],[f704]) ).
thf(f704,plain,
( ! [X2: $o,X0: $o,X1: $o] :
( ( X0 = X1 )
| ( $false = X0 )
| ( $true
= ( X1 = X2 ) ) )
| ~ spl1_11 ),
inference(leibniz_equality_elimination,[],[f702]) ).
thf(f702,plain,
( ! [X2: $o > $o,X3: $o,X4: $o,X5: $o] :
( ( $false
= ( X2 @ X5 ) )
| ( $false = X4 )
| ( ( X2 @ X4 )
= $true )
| ( ( X2 @ X3 )
= $true ) )
| ~ spl1_11 ),
inference(beta_eta_normalization,[],[f698]) ).
thf(f698,plain,
( ! [X2: $o > $o,X3: $o,X4: $o,X5: $o] :
( ( $false = X4 )
| ( ( X2 @ X3 )
= $true )
| ( ( X2 @ X5 )
= ( ^ [Y0: $o] : $false
@ X5 ) )
| ( ( X2 @ X4 )
= $true ) )
| ~ spl1_11 ),
inference(argument_congruence,[],[f638]) ).
thf(f638,plain,
( ! [X2: $o > $o,X3: $o,X4: $o] :
( ( ( ^ [Y0: $o] : $false )
= X2 )
| ( $false = X4 )
| ( ( X2 @ X4 )
= $true )
| ( ( X2 @ X3 )
= $true ) )
| ~ spl1_11 ),
inference(avatar_component_clause,[],[f637]) ).
thf(f639,plain,
( spl1_2
| spl1_11
| ~ spl1_5 ),
inference(avatar_split_clause,[],[f620,f518,f637,f507]) ).
thf(f518,plain,
( spl1_5
<=> ! [X2: $o > $o,X1: $o,X3: $o] :
( ( $false = X1 )
| ( ( X2 @ X3 )
= $true )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( (=) @ X1 )
= X2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_5])]) ).
thf(f620,plain,
( ! [X2: $o > $o,X3: $o,X1: $o,X4: $o] :
( ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( X2 @ X4 )
= $true )
| ( ( X2 @ X3 )
= $true )
| ( $false = X4 )
| ( $false = X1 ) )
| ~ spl1_5 ),
inference(duplicate_literal_removal,[],[f619]) ).
thf(f619,plain,
( ! [X2: $o > $o,X3: $o,X1: $o,X4: $o] :
( ( $false = X1 )
| ( ( X2 @ X4 )
= $true )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( $false = X4 )
| ( $false = X1 )
| ( ( X2 @ X3 )
= $true ) )
| ~ spl1_5 ),
inference(binary_proxy_clausification,[],[f617]) ).
thf(f617,plain,
( ! [X2: $o > $o,X3: $o,X1: $o,X4: $o] :
( ( $false = X1 )
| ( ( X2 @ X3 )
= $true )
| ( ( X2 @ X4 )
= $true )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( X1 != X4 ) )
| ~ spl1_5 ),
inference(equality_proxy_clausification,[],[f611]) ).
thf(f611,plain,
( ! [X2: $o > $o,X3: $o,X1: $o,X4: $o] :
( ( $false
= ( X1 = X4 ) )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( X2 @ X4 )
= $true )
| ( $false = X1 )
| ( ( X2 @ X3 )
= $true ) )
| ~ spl1_5 ),
inference(binary_proxy_clausification,[],[f606]) ).
thf(f606,plain,
( ! [X2: $o > $o,X3: $o,X1: $o,X4: $o] :
( ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( X2 @ X4 )
= ( X1 = X4 ) )
| ( ( X2 @ X3 )
= $true )
| ( $false = X1 ) )
| ~ spl1_5 ),
inference(argument_congruence,[],[f519]) ).
thf(f519,plain,
( ! [X2: $o > $o,X3: $o,X1: $o] :
( ( ( (=) @ X1 )
= X2 )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( X2 @ X3 )
= $true )
| ( $false = X1 ) )
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f518]) ).
thf(f601,plain,
~ spl1_4,
inference(avatar_contradiction_clause,[],[f600]) ).
thf(f600,plain,
( $false
| ~ spl1_4 ),
inference(equality_resolution,[],[f595]) ).
thf(f595,plain,
( ! [X0: $o] : ( $false != X0 )
| ~ spl1_4 ),
inference(superposition,[],[f3,f515]) ).
thf(f515,plain,
( ! [X1: $o] : ( $true = X1 )
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f514]) ).
thf(f3,plain,
$false != $true,
introduced(fool_axiom,[]) ).
thf(f593,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f592]) ).
thf(f592,plain,
( $false
| ~ spl1_2 ),
inference(trivial_inequality_removal,[],[f589]) ).
thf(f589,plain,
( ( $false != $false )
| ~ spl1_2 ),
inference(superposition,[],[f3,f508]) ).
thf(f508,plain,
( ! [X1: $o] : ( $false = X1 )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f507]) ).
thf(f520,plain,
( spl1_4
| spl1_5 ),
inference(avatar_split_clause,[],[f496,f518,f514]) ).
thf(f496,plain,
! [X2: $o > $o,X3: $o,X0: $o,X1: $o] :
( ( $false = X1 )
| ( $true = X0 )
| ( ( (=) @ X1 )
= X2 )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( X2 @ X3 )
= $true ) ),
inference(binary_proxy_clausification,[],[f486]) ).
thf(f486,plain,
! [X2: $o > $o,X3: $o,X0: $o,X1: $o] :
( ( ( X2 @ X3 )
= $true )
| ( X0 = X1 )
| ( ( (=) @ X1 )
= X2 )
| ( ( ^ [Y0: $o] : $false )
= X2 ) ),
inference(leibniz_equality_elimination,[],[f485]) ).
thf(f485,plain,
! [X2: $o > $o,X0: $o > $o,X6: $o,X7: $o,X4: $o] :
( ( ( ^ [Y0: $o] : $false )
= X0 )
| ( X0 = X2 )
| ( ( X2 @ X4 )
= $true )
| ( ( X2 @ X7 )
= $false )
| ( ( X0 @ X6 )
= $true ) ),
inference(beta_eta_normalization,[],[f477]) ).
thf(f477,plain,
! [X2: $o > $o,X0: $o > $o,X6: $o,X7: $o,X4: $o] :
( ( ( X0 @ X6 )
= $true )
| ( ( ^ [Y0: $o] : $false
@ X7 )
= ( X2 @ X7 ) )
| ( ( ^ [Y0: $o] : $false )
= X0 )
| ( ( X2 @ X4 )
= $true )
| ( X0 = X2 ) ),
inference(argument_congruence,[],[f472]) ).
thf(f472,plain,
! [X2: $o > $o,X0: $o > $o,X6: $o,X4: $o] :
( ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( X2 @ X4 )
= $true )
| ( ( ^ [Y0: $o] : $false )
= X0 )
| ( X0 = X2 )
| ( ( X0 @ X6 )
= $true ) ),
inference(trivial_inequality_removal,[],[f471]) ).
thf(f471,plain,
! [X2: $o > $o,X0: $o > $o,X6: $o,X4: $o] :
( ( ( ^ [Y0: $o] : $false )
= X0 )
| ( ( X2 @ X4 )
= $true )
| ( X0 = X2 )
| ( $false = $true )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( X0 @ X6 )
= $true ) ),
inference(beta_eta_normalization,[],[f462]) ).
thf(f462,plain,
! [X2: $o > $o,X0: $o > $o,X6: $o,X4: $o,X5: $o] :
( ( ( ^ [Y0: $o] : $false )
= X0 )
| ( ( X0 @ X6 )
= $true )
| ( X0 = X2 )
| ( $true
= ( ^ [Y0: $o] : $false
@ X5 ) )
| ( ( X2 @ X4 )
= $true )
| ( ( ^ [Y0: $o] : $false )
= X2 ) ),
inference(primitive_instantiation,[],[f453]) ).
thf(f453,plain,
! [X2: $o > $o,X0: $o > $o,X1: $o > $o,X6: $o,X4: $o,X5: $o] :
( ( $true
= ( X1 @ X5 ) )
| ( X1 = X2 )
| ( X0 = X2 )
| ( ( X2 @ X4 )
= $true )
| ( X0 = X1 )
| ( ( X0 @ X6 )
= $true ) ),
inference(beta_eta_normalization,[],[f439]) ).
thf(f439,plain,
! [X2: $o > $o,X0: $o > $o,X1: $o > $o,X6: $o,X4: $o,X5: $o] :
( ( X0 = X1 )
| ( $true
= ( X1 @ X5 ) )
| ( X0 = X2 )
| ( ( X2 @ X4 )
= $true )
| ( X1 = X2 )
| ( ( ^ [Y0: $o] : $true
@ X6 )
= ( X0 @ X6 ) ) ),
inference(argument_congruence,[],[f434]) ).
thf(f434,plain,
! [X2: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o,X5: $o] :
( ( ( ^ [Y0: $o] : $true )
= X0 )
| ( X0 = X1 )
| ( $true
= ( X1 @ X5 ) )
| ( X1 = X2 )
| ( ( X2 @ X4 )
= $true )
| ( X0 = X2 ) ),
inference(beta_eta_normalization,[],[f417]) ).
thf(f417,plain,
! [X2: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o,X5: $o] :
( ( X0 = X1 )
| ( ( ^ [Y0: $o] : $true )
= X0 )
| ( ( X2 @ X4 )
= $true )
| ( X1 = X2 )
| ( X0 = X2 )
| ( ( ^ [Y0: $o] : $true
@ X5 )
= ( X1 @ X5 ) ) ),
inference(argument_congruence,[],[f413]) ).
thf(f413,plain,
! [X2: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o] :
( ( ( ^ [Y0: $o] : $true )
= X1 )
| ( X0 = X1 )
| ( ( X2 @ X4 )
= $true )
| ( X0 = X2 )
| ( X1 = X2 )
| ( ( ^ [Y0: $o] : $true )
= X0 ) ),
inference(trivial_inequality_removal,[],[f412]) ).
thf(f412,plain,
! [X2: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o] :
( ( X1 = X2 )
| ( X0 = X2 )
| ( $false = $true )
| ( ( ^ [Y0: $o] : $true )
= X0 )
| ( X0 = X1 )
| ( ( X2 @ X4 )
= $true )
| ( ( ^ [Y0: $o] : $true )
= X1 ) ),
inference(beta_eta_normalization,[],[f406]) ).
thf(f406,plain,
! [X2: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o] :
( ( X0 = X2 )
| ( ( ^ [Y0: $o] : $true )
= X0 )
| ( ( ^ [Y0: $o] : $true )
= X1 )
| ( X1 = X2 )
| ( X0 = X1 )
| ( ( ^ [Y0: $o] : $true
@ X4 )
= $false )
| ( ( X2 @ X4 )
= $true ) ),
inference(primitive_instantiation,[],[f396]) ).
thf(f396,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o] :
( ( $false
= ( X3 @ X4 ) )
| ( X0 = X3 )
| ( ( X2 @ X4 )
= $true )
| ( X0 = X2 )
| ( X1 = X2 )
| ( X0 = X1 )
| ( X1 = X3 ) ),
inference(binary_proxy_clausification,[],[f382]) ).
thf(f382,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o] :
( ( X1 = X3 )
| ( X0 = X3 )
| ( X0 = X1 )
| ( ( X2 @ X4 )
= ( X3 @ X4 ) )
| ( X1 = X2 )
| ( X0 = X2 ) ),
inference(argument_congruence,[],[f381]) ).
thf(f381,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X2 = X3 )
| ( X0 = X1 )
| ( X0 = X3 )
| ( X0 = X2 )
| ( X1 = X3 )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f380]) ).
thf(f380,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X0 = X1 )
| ( X1 = X2 )
| ( X1 = X3 )
| ( X2 = X3 )
| ( $true != $true )
| ( X0 = X2 )
| ( X0 = X3 ) ),
inference(duplicate_literal_removal,[],[f365]) ).
thf(f365,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X2 = X3 )
| ( X0 = X1 )
| ( X0 = X1 )
| ( X0 = X2 )
| ( $true != $true )
| ( X1 = X2 )
| ( X0 = X3 )
| ( X1 = X3 ) ),
inference(superposition,[],[f16,f358]) ).
thf(f358,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X2 @ X1 )
= $true )
| ( X2 = X3 )
| ( X0 = X1 )
| ( X0 = X2 )
| ( X0 = X3 )
| ( X1 = X2 )
| ( X1 = X3 ) ),
inference(trivial_inequality_removal,[],[f357]) ).
thf(f357,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X1 = X3 )
| ( X0 = X3 )
| ( X0 = X2 )
| ( X1 = X2 )
| ( X0 = X1 )
| ( $true != $true )
| ( X2 = X3 )
| ( ( sK0 @ X2 @ X1 )
= $true ) ),
inference(duplicate_literal_removal,[],[f341]) ).
thf(f341,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X2 = X3 )
| ( $true != $true )
| ( X0 = X2 )
| ( X0 = X1 )
| ( X1 = X2 )
| ( X0 = X3 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( X0 = X1 )
| ( X1 = X3 ) ),
inference(superposition,[],[f16,f331]) ).
thf(f331,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X0 @ X2 ) )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( X0 = X3 )
| ( X0 = X2 )
| ( X1 = X2 )
| ( X2 = X3 )
| ( X1 = X3 )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[],[f330]) ).
thf(f330,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X0 @ X2 ) )
| ( $false = $true )
| ( X1 = X3 )
| ( X1 = X2 )
| ( X2 = X3 )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( X0 = X2 )
| ( X0 = X3 )
| ( X0 = X1 ) ),
inference(duplicate_literal_removal,[],[f317]) ).
thf(f317,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X0 = X2 )
| ( X2 = X3 )
| ( X0 = X1 )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( X0 = X3 )
| ( X1 = X3 )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( X1 = X2 )
| ( $false = $true )
| ( X0 = X1 ) ),
inference(superposition,[],[f20,f309]) ).
thf(f309,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X3 @ X0 ) )
| ( X1 = X2 )
| ( X0 = X3 )
| ( X0 = X1 )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( ( sK0 @ X3 @ X2 )
= $true )
| ( X0 = X2 )
| ( X1 = X3 )
| ( X2 = X3 ) ),
inference(trivial_inequality_removal,[],[f308]) ).
thf(f308,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X1 = X3 )
| ( X0 = X1 )
| ( X0 = X2 )
| ( X1 = X2 )
| ( $true
= ( sK0 @ X3 @ X0 ) )
| ( X0 = X3 )
| ( X2 = X3 )
| ( $false = $true )
| ( ( sK0 @ X3 @ X2 )
= $true )
| ( $true
= ( sK0 @ X0 @ X2 ) ) ),
inference(duplicate_literal_removal,[],[f284]) ).
thf(f284,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X1 = X2 )
| ( X0 = X1 )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( $true
= ( sK0 @ X3 @ X0 ) )
| ( X1 = X3 )
| ( $false = $true )
| ( X0 = X3 )
| ( X0 = X2 )
| ( X2 = X3 )
| ( ( sK0 @ X3 @ X2 )
= $true )
| ( X0 = X1 ) ),
inference(superposition,[],[f281,f20]) ).
thf(f281,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X3 @ X1 ) )
| ( X1 = X2 )
| ( X2 = X3 )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( $true
= ( sK0 @ X3 @ X0 ) )
| ( X0 = X3 )
| ( X1 = X3 )
| ( $true
= ( sK0 @ X2 @ X0 ) )
| ( X0 = X2 )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[],[f280]) ).
thf(f280,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X0 = X3 )
| ( $true
= ( sK0 @ X3 @ X0 ) )
| ( X0 = X2 )
| ( $false = $true )
| ( $true
= ( sK0 @ X2 @ X0 ) )
| ( X0 = X1 )
| ( X2 = X3 )
| ( X1 = X3 )
| ( $true
= ( sK0 @ X3 @ X1 ) )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( X1 = X2 ) ),
inference(duplicate_literal_removal,[],[f259]) ).
thf(f259,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X0 = X1 )
| ( X0 = X1 )
| ( X0 = X3 )
| ( $true
= ( sK0 @ X2 @ X0 ) )
| ( $true
= ( sK0 @ X3 @ X0 ) )
| ( X2 = X3 )
| ( $true
= ( sK0 @ X3 @ X1 ) )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( $false = $true )
| ( X1 = X3 )
| ( X0 = X2 )
| ( X1 = X2 ) ),
inference(superposition,[],[f20,f251]) ).
thf(f251,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X3 @ X1 ) )
| ( $true
= ( sK0 @ X0 @ X3 ) )
| ( X0 = X1 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( X0 = X2 )
| ( X0 = X3 )
| ( X1 = X2 )
| ( X1 = X3 )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( X2 = X3 ) ),
inference(trivial_inequality_removal,[],[f250]) ).
thf(f250,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X0 @ X2 ) )
| ( $true
= ( sK0 @ X3 @ X1 ) )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( X2 = X3 )
| ( $true != $true )
| ( X1 = X2 )
| ( $true
= ( sK0 @ X0 @ X3 ) )
| ( X0 = X2 )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( X0 = X3 )
| ( X1 = X3 )
| ( X0 = X1 ) ),
inference(duplicate_literal_removal,[],[f225]) ).
thf(f225,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X0 = X1 )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( X0 = X3 )
| ( $true
= ( sK0 @ X0 @ X3 ) )
| ( $true
= ( sK0 @ X3 @ X1 ) )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( X2 = X3 )
| ( X1 = X2 )
| ( X1 = X3 )
| ( X0 = X2 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( X0 = X1 )
| ( $true != $true ) ),
inference(superposition,[],[f16,f199]) ).
thf(f199,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X3 @ X1 ) )
| ( X2 = X3 )
| ( X0 = X1 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( X0 = X2 )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( ( sK0 @ X3 @ X2 )
= $true )
| ( $true
= ( sK0 @ X3 @ X0 ) )
| ( X1 = X3 )
| ( X1 = X2 )
| ( X0 = X3 )
| ( $true
= ( sK0 @ X0 @ X1 ) ) ),
inference(equality_proxy_clausification,[],[f198]) ).
thf(f198,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X1 = X2 )
| ( $true
= ( sK0 @ X3 @ X0 ) )
| ( $true
= ( sK0 @ X0 @ X1 ) )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( $true
= ( X1 = X3 ) )
| ( X0 = X1 )
| ( ( sK0 @ X3 @ X2 )
= $true )
| ( X2 = X3 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( $true
= ( sK0 @ X3 @ X1 ) )
| ( X0 = X2 )
| ( X0 = X3 ) ),
inference(duplicate_literal_removal,[],[f197]) ).
thf(f197,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X2 = X3 )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( X1 = X2 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( $true
= ( sK0 @ X3 @ X0 ) )
| ( X1 = X2 )
| ( X0 = X3 )
| ( $true
= ( sK0 @ X3 @ X1 ) )
| ( ( sK0 @ X3 @ X2 )
= $true )
| ( X0 = X2 )
| ( X0 = X1 )
| ( $true
= ( X1 = X3 ) )
| ( $true
= ( sK0 @ X0 @ X1 ) ) ),
inference(equality_proxy_clausification,[],[f196]) ).
thf(f196,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X0 = X3 )
| ( X0 = X1 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( ( sK0 @ X3 @ X2 )
= $true )
| ( X1 = X2 )
| ( ( X1 = X2 )
= $true )
| ( $true
= ( sK0 @ X3 @ X1 ) )
| ( X0 = X2 )
| ( $true
= ( X1 = X3 ) )
| ( X2 = X3 )
| ( $true
= ( sK0 @ X3 @ X0 ) )
| ( $true
= ( sK0 @ X0 @ X1 ) )
| ( $true
= ( sK0 @ X0 @ X2 ) ) ),
inference(duplicate_literal_removal,[],[f172]) ).
thf(f172,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X3 @ X0 ) )
| ( $true
= ( X1 = X3 ) )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( X0 = X1 )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( ( sK0 @ X3 @ X2 )
= $true )
| ( X0 = X1 )
| ( ( X1 = X2 )
= $true )
| ( X2 = X3 )
| ( $true
= ( sK0 @ X0 @ X1 ) )
| ( X0 = X2 )
| ( X0 = X3 )
| ( X1 = X2 )
| ( $true
= ( sK0 @ X3 @ X1 ) ) ),
inference(leibniz_equality_elimination,[],[f153]) ).
thf(f153,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: ( $o > $o ) > $o] :
( ( $true
= ( sK0 @ X3 @ X1 ) )
| ( X0 = X1 )
| ( $true
= ( sK0 @ X0 @ X1 ) )
| ( $true
= ( sK0 @ X2 @ X0 ) )
| ( ( X4 @ X0 )
= $true )
| ( $true
= ( sK0 @ X0 @ X3 ) )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( ( X4 @ X1 )
!= $true )
| ( ( X4 @ X2 )
= $true )
| ( $true
= ( X4 @ X3 ) )
| ( X2 = X3 )
| ( X0 = X2 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( X1 = X3 )
| ( X0 = X3 ) ),
inference(equality_proxy_clausification,[],[f152]) ).
thf(f152,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: ( $o > $o ) > $o] :
( ( $true
= ( sK0 @ X3 @ X1 ) )
| ( ( X0 = X2 )
= $true )
| ( $true
= ( X4 @ X3 ) )
| ( $true
= ( sK0 @ X0 @ X1 ) )
| ( ( X4 @ X2 )
= $true )
| ( X0 = X1 )
| ( X1 = X3 )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( $true
= ( sK0 @ X0 @ X3 ) )
| ( X0 = X3 )
| ( ( X4 @ X0 )
= $true )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( ( X4 @ X1 )
!= $true )
| ( $true
= ( sK0 @ X2 @ X0 ) )
| ( X2 = X3 ) ),
inference(duplicate_literal_removal,[],[f151]) ).
thf(f151,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: ( $o > $o ) > $o] :
( ( $true
= ( sK0 @ X2 @ X3 ) )
| ( X0 = X1 )
| ( $true
= ( sK0 @ X3 @ X1 ) )
| ( X1 = X3 )
| ( $true
= ( sK0 @ X0 @ X1 ) )
| ( $true
= ( X4 @ X3 ) )
| ( ( X4 @ X1 )
!= $true )
| ( X0 = X3 )
| ( $true
= ( sK0 @ X2 @ X0 ) )
| ( ( X4 @ X0 )
= $true )
| ( X0 = X3 )
| ( X2 = X3 )
| ( ( X0 = X2 )
= $true )
| ( ( X4 @ X2 )
= $true )
| ( $true
= ( sK0 @ X0 @ X3 ) )
| ( ( sK0 @ X2 @ X1 )
= $true ) ),
inference(equality_proxy_clausification,[],[f123]) ).
thf(f123,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: ( $o > $o ) > $o] :
( ( ( X4 @ X2 )
= $true )
| ( ( X0 = X3 )
= $true )
| ( X1 = X3 )
| ( X0 = X3 )
| ( X2 = X3 )
| ( $true
= ( sK0 @ X0 @ X3 ) )
| ( ( X4 @ X0 )
= $true )
| ( ( X4 @ X1 )
!= $true )
| ( X0 = X1 )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( $true
= ( sK0 @ X0 @ X1 ) )
| ( ( X0 = X2 )
= $true )
| ( $true
= ( sK0 @ X2 @ X0 ) )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( $true
= ( X4 @ X3 ) )
| ( $true
= ( sK0 @ X3 @ X1 ) ) ),
inference(leibniz_equality_elimination,[],[f101]) ).
thf(f101,plain,
! [X2: $o > $o,X3: ( $o > $o ) > $o,X0: $o > $o,X1: $o > $o,X4: ( $o > $o ) > $o,X5: $o > $o] :
( ( $true
= ( sK0 @ X5 @ X2 ) )
| ( $true
= ( X4 @ X5 ) )
| ( ( X4 @ X0 )
= $true )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( X0 = X1 )
| ( ( X4 @ X1 )
!= $true )
| ( X0 = X2 )
| ( $true
= ( sK0 @ X5 @ X0 ) )
| ( X0 = X5 )
| ( ( X4 @ X2 )
= $true )
| ( $true
= ( X3 @ X1 ) )
| ( ( X3 @ X0 )
= $true )
| ( ( X3 @ X2 )
!= $true )
| ( ( sK0 @ X5 @ X1 )
= $true )
| ( $true
= ( sK0 @ X1 @ X0 ) )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( $true
= ( X3 @ X5 ) ) ),
inference(equality_proxy_clausification,[],[f100]) ).
thf(f100,plain,
! [X2: $o > $o,X3: ( $o > $o ) > $o,X0: $o > $o,X1: $o > $o,X4: ( $o > $o ) > $o,X5: $o > $o] :
( ( ( X4 @ X0 )
= $true )
| ( $true
= ( X0 = X5 ) )
| ( $true
= ( X3 @ X1 ) )
| ( $true
= ( sK0 @ X1 @ X0 ) )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( ( X4 @ X1 )
!= $true )
| ( $true
= ( sK0 @ X5 @ X2 ) )
| ( $true
= ( sK0 @ X5 @ X0 ) )
| ( $true
= ( X4 @ X5 ) )
| ( ( X3 @ X0 )
= $true )
| ( ( sK0 @ X5 @ X1 )
= $true )
| ( X0 = X2 )
| ( ( X3 @ X2 )
!= $true )
| ( ( X4 @ X2 )
= $true )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( X0 = X1 )
| ( $true
= ( X3 @ X5 ) ) ),
inference(equality_proxy_clausification,[],[f67]) ).
thf(f67,plain,
! [X2: $o > $o,X3: ( $o > $o ) > $o,X0: $o > $o,X1: $o > $o,X4: ( $o > $o ) > $o,X5: $o > $o] :
( ( $true
= ( sK0 @ X5 @ X2 ) )
| ( ( sK0 @ X5 @ X1 )
= $true )
| ( $true
= ( X4 @ X5 ) )
| ( $true
= ( sK0 @ X1 @ X0 ) )
| ( ( X4 @ X0 )
= $true )
| ( X0 = X1 )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( $true
= ( sK0 @ X0 @ X2 ) )
| ( ( X3 @ X0 )
= $true )
| ( $true
= ( X3 @ X5 ) )
| ( ( X0 = X2 )
= $true )
| ( $true
= ( X3 @ X1 ) )
| ( $true
= ( X0 = X5 ) )
| ( ( X3 @ X2 )
!= $true )
| ( ( X4 @ X1 )
!= $true )
| ( ( X4 @ X2 )
= $true )
| ( $true
= ( sK0 @ X5 @ X0 ) ) ),
inference(leibniz_equality_elimination,[],[f12]) ).
thf(f12,plain,
! [X10: ( $o > $o ) > $o,X11: $o > $o,X8: $o > $o,X6: ( $o > $o ) > $o,X9: $o > $o,X7: ( $o > $o ) > $o,X12: $o > $o] :
( ( $true
= ( sK0 @ X12 @ X8 ) )
| ( ( sK0 @ X8 @ X9 )
= $true )
| ( $true
= ( sK0 @ X11 @ X8 ) )
| ( ( X7 @ X11 )
= $true )
| ( ( sK0 @ X11 @ X9 )
= $true )
| ( ( X7 @ X8 )
= $true )
| ( $true
= ( X6 @ X8 ) )
| ( ( X6 @ X12 )
= $true )
| ( $true
= ( X10 @ X11 ) )
| ( ( X7 @ X12 )
!= $true )
| ( $true
= ( X10 @ X12 ) )
| ( ( X7 @ X9 )
= $true )
| ( $true
!= ( X10 @ X8 ) )
| ( ( X10 @ X9 )
= $true )
| ( $true
= ( sK0 @ X11 @ X12 ) )
| ( ( sK0 @ X12 @ X9 )
= $true )
| ( $true
= ( X6 @ X11 ) )
| ( ( X6 @ X9 )
!= $true ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ! [X1: $o > $o,X2: ( $o > $o ) > $o,X3: $o > $o] :
( ( $true
= ( X2 @ X1 ) )
| ( ( X2 @ X3 )
!= $true )
| ( ( sK0 @ X1 @ X3 )
!= $true ) )
& ! [X4: $o > $o,X5: $o > $o] :
( ( $true
!= ( sK0 @ X4 @ X5 ) )
| ( ( sK0 @ X5 @ X4 )
= $true ) )
& ! [X6: ( $o > $o ) > $o,X7: ( $o > $o ) > $o,X8: $o > $o,X9: $o > $o,X10: ( $o > $o ) > $o,X11: $o > $o,X12: $o > $o] :
( ( $true
= ( sK0 @ X11 @ X12 ) )
| ( ( sK0 @ X11 @ X9 )
= $true )
| ( $true
!= ( X10 @ X8 ) )
| ( ( sK0 @ X8 @ X9 )
= $true )
| ( $true
= ( sK0 @ X11 @ X8 ) )
| ( ( X6 @ X12 )
= $true )
| ( $true
= ( X10 @ X11 ) )
| ( ( X7 @ X12 )
!= $true )
| ( $true
= ( X6 @ X8 ) )
| ( ( X7 @ X11 )
= $true )
| ( ( sK0 @ X12 @ X9 )
= $true )
| ( ( X7 @ X9 )
= $true )
| ( $true
= ( sK0 @ X12 @ X8 ) )
| ( ( X6 @ X9 )
!= $true )
| ( $true
= ( X10 @ X12 ) )
| ( ( X7 @ X8 )
= $true )
| ( ( X10 @ X9 )
= $true )
| ( $true
= ( X6 @ X11 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).
thf(f10,plain,
( ? [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X1: $o > $o,X2: ( $o > $o ) > $o,X3: $o > $o] :
( ( $true
= ( X2 @ X1 ) )
| ( ( X2 @ X3 )
!= $true )
| ( ( X0 @ X1 @ X3 )
!= $true ) )
& ! [X4: $o > $o,X5: $o > $o] :
( ( ( X0 @ X4 @ X5 )
!= $true )
| ( ( X0 @ X5 @ X4 )
= $true ) )
& ! [X6: ( $o > $o ) > $o,X7: ( $o > $o ) > $o,X8: $o > $o,X9: $o > $o,X10: ( $o > $o ) > $o,X11: $o > $o,X12: $o > $o] :
( ( $true
= ( X0 @ X11 @ X12 ) )
| ( $true
= ( X0 @ X11 @ X9 ) )
| ( $true
!= ( X10 @ X8 ) )
| ( ( X0 @ X8 @ X9 )
= $true )
| ( ( X0 @ X11 @ X8 )
= $true )
| ( ( X6 @ X12 )
= $true )
| ( $true
= ( X10 @ X11 ) )
| ( ( X7 @ X12 )
!= $true )
| ( $true
= ( X6 @ X8 ) )
| ( ( X7 @ X11 )
= $true )
| ( ( X0 @ X12 @ X9 )
= $true )
| ( ( X7 @ X9 )
= $true )
| ( $true
= ( X0 @ X12 @ X8 ) )
| ( ( X6 @ X9 )
!= $true )
| ( $true
= ( X10 @ X12 ) )
| ( ( X7 @ X8 )
= $true )
| ( ( X10 @ X9 )
= $true )
| ( $true
= ( X6 @ X11 ) ) ) )
=> ( ! [X3: $o > $o,X2: ( $o > $o ) > $o,X1: $o > $o] :
( ( $true
= ( X2 @ X1 ) )
| ( ( X2 @ X3 )
!= $true )
| ( ( sK0 @ X1 @ X3 )
!= $true ) )
& ! [X5: $o > $o,X4: $o > $o] :
( ( $true
!= ( sK0 @ X4 @ X5 ) )
| ( ( sK0 @ X5 @ X4 )
= $true ) )
& ! [X12: $o > $o,X11: $o > $o,X10: ( $o > $o ) > $o,X9: $o > $o,X8: $o > $o,X7: ( $o > $o ) > $o,X6: ( $o > $o ) > $o] :
( ( $true
= ( sK0 @ X11 @ X12 ) )
| ( ( sK0 @ X11 @ X9 )
= $true )
| ( $true
!= ( X10 @ X8 ) )
| ( ( sK0 @ X8 @ X9 )
= $true )
| ( $true
= ( sK0 @ X11 @ X8 ) )
| ( ( X6 @ X12 )
= $true )
| ( $true
= ( X10 @ X11 ) )
| ( ( X7 @ X12 )
!= $true )
| ( $true
= ( X6 @ X8 ) )
| ( ( X7 @ X11 )
= $true )
| ( ( sK0 @ X12 @ X9 )
= $true )
| ( ( X7 @ X9 )
= $true )
| ( $true
= ( sK0 @ X12 @ X8 ) )
| ( ( X6 @ X9 )
!= $true )
| ( $true
= ( X10 @ X12 ) )
| ( ( X7 @ X8 )
= $true )
| ( ( X10 @ X9 )
= $true )
| ( $true
= ( X6 @ X11 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X1: $o > $o,X2: ( $o > $o ) > $o,X3: $o > $o] :
( ( $true
= ( X2 @ X1 ) )
| ( ( X2 @ X3 )
!= $true )
| ( ( X0 @ X1 @ X3 )
!= $true ) )
& ! [X4: $o > $o,X5: $o > $o] :
( ( ( X0 @ X4 @ X5 )
!= $true )
| ( ( X0 @ X5 @ X4 )
= $true ) )
& ! [X6: ( $o > $o ) > $o,X7: ( $o > $o ) > $o,X8: $o > $o,X9: $o > $o,X10: ( $o > $o ) > $o,X11: $o > $o,X12: $o > $o] :
( ( $true
= ( X0 @ X11 @ X12 ) )
| ( $true
= ( X0 @ X11 @ X9 ) )
| ( $true
!= ( X10 @ X8 ) )
| ( ( X0 @ X8 @ X9 )
= $true )
| ( ( X0 @ X11 @ X8 )
= $true )
| ( ( X6 @ X12 )
= $true )
| ( $true
= ( X10 @ X11 ) )
| ( ( X7 @ X12 )
!= $true )
| ( $true
= ( X6 @ X8 ) )
| ( ( X7 @ X11 )
= $true )
| ( ( X0 @ X12 @ X9 )
= $true )
| ( ( X7 @ X9 )
= $true )
| ( $true
= ( X0 @ X12 @ X8 ) )
| ( ( X6 @ X9 )
!= $true )
| ( $true
= ( X10 @ X12 ) )
| ( ( X7 @ X8 )
= $true )
| ( ( X10 @ X9 )
= $true )
| ( $true
= ( X6 @ X11 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X5: $o > $o,X4: ( $o > $o ) > $o,X3: $o > $o] :
( ( $true
= ( X4 @ X5 ) )
| ( $true
!= ( X4 @ X3 ) )
| ( ( X0 @ X5 @ X3 )
!= $true ) )
& ! [X1: $o > $o,X2: $o > $o] :
( ( ( X0 @ X1 @ X2 )
!= $true )
| ( ( X0 @ X2 @ X1 )
= $true ) )
& ! [X7: ( $o > $o ) > $o,X12: ( $o > $o ) > $o,X6: $o > $o,X11: $o > $o,X10: ( $o > $o ) > $o,X8: $o > $o,X9: $o > $o] :
( ( ( X0 @ X8 @ X9 )
= $true )
| ( $true
= ( X0 @ X8 @ X11 ) )
| ( ( X10 @ X6 )
!= $true )
| ( ( X0 @ X6 @ X11 )
= $true )
| ( $true
= ( X0 @ X8 @ X6 ) )
| ( ( X7 @ X9 )
= $true )
| ( $true
= ( X10 @ X8 ) )
| ( ( X12 @ X9 )
!= $true )
| ( $true
= ( X7 @ X6 ) )
| ( ( X12 @ X8 )
= $true )
| ( $true
= ( X0 @ X9 @ X11 ) )
| ( $true
= ( X12 @ X11 ) )
| ( ( X0 @ X9 @ X6 )
= $true )
| ( ( X7 @ X11 )
!= $true )
| ( ( X10 @ X9 )
= $true )
| ( ( X12 @ X6 )
= $true )
| ( $true
= ( X10 @ X11 ) )
| ( ( X7 @ X8 )
= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X5: $o > $o,X4: ( $o > $o ) > $o,X3: $o > $o] :
( ( $true
= ( X4 @ X5 ) )
| ( $true
!= ( X4 @ X3 ) )
| ( ( X0 @ X5 @ X3 )
!= $true ) )
& ! [X7: ( $o > $o ) > $o,X12: ( $o > $o ) > $o,X6: $o > $o,X11: $o > $o,X10: ( $o > $o ) > $o,X8: $o > $o,X9: $o > $o] :
( ( ( X0 @ X8 @ X9 )
= $true )
| ( $true
= ( X0 @ X8 @ X11 ) )
| ( ( X10 @ X6 )
!= $true )
| ( ( X0 @ X6 @ X11 )
= $true )
| ( $true
= ( X0 @ X8 @ X6 ) )
| ( ( X7 @ X9 )
= $true )
| ( $true
= ( X10 @ X8 ) )
| ( ( X12 @ X9 )
!= $true )
| ( $true
= ( X7 @ X6 ) )
| ( ( X12 @ X8 )
= $true )
| ( $true
= ( X0 @ X9 @ X11 ) )
| ( $true
= ( X12 @ X11 ) )
| ( ( X0 @ X9 @ X6 )
= $true )
| ( ( X7 @ X11 )
!= $true )
| ( ( X10 @ X9 )
= $true )
| ( ( X12 @ X6 )
= $true )
| ( $true
= ( X10 @ X11 ) )
| ( ( X7 @ X8 )
= $true ) )
& ! [X1: $o > $o,X2: $o > $o] :
( ( ( X0 @ X1 @ X2 )
!= $true )
| ( ( X0 @ X2 @ X1 )
= $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X2: $o > $o,X1: $o > $o] :
( ( ( X0 @ X1 @ X2 )
= $true )
=> ( ( X0 @ X2 @ X1 )
= $true ) )
=> ( ? [X5: $o > $o,X4: ( $o > $o ) > $o,X3: $o > $o] :
( ( $true
= ( X4 @ X3 ) )
& ( ( X0 @ X5 @ X3 )
= $true )
& ( $true
!= ( X4 @ X5 ) ) )
| ? [X8: $o > $o,X12: ( $o > $o ) > $o,X10: ( $o > $o ) > $o,X6: $o > $o,X9: $o > $o,X7: ( $o > $o ) > $o,X11: $o > $o] :
( ( $true
!= ( X0 @ X9 @ X11 ) )
& ( ( X7 @ X11 )
= $true )
& ( ( X7 @ X9 )
!= $true )
& ( ( X0 @ X8 @ X9 )
!= $true )
& ( ( X0 @ X6 @ X11 )
!= $true )
& ( $true
!= ( X0 @ X8 @ X11 ) )
& ( ( X12 @ X9 )
= $true )
& ( $true
!= ( X0 @ X8 @ X6 ) )
& ( ( X12 @ X6 )
!= $true )
& ( ( X10 @ X6 )
= $true )
& ( $true
!= ( X10 @ X11 ) )
& ( ( X7 @ X8 )
!= $true )
& ( ( X0 @ X9 @ X6 )
!= $true )
& ( ( X12 @ X8 )
!= $true )
& ( ( X10 @ X9 )
!= $true )
& ( $true
!= ( X7 @ X6 ) )
& ( $true
!= ( X10 @ X8 ) )
& ( $true
!= ( X12 @ X11 ) ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X2: $o > $o,X1: $o > $o] :
( ( ( X0 @ X1 @ X2 )
= $true )
=> ( ( X0 @ X2 @ X1 )
= $true ) )
=> ( ? [X3: $o > $o,X4: ( $o > $o ) > $o,X5: $o > $o] :
( ( ( X0 @ X5 @ X3 )
= $true )
& ( $true
!= ( X4 @ X5 ) )
& ( $true
= ( X4 @ X3 ) ) )
| ? [X6: $o > $o,X7: ( $o > $o ) > $o,X8: $o > $o,X9: $o > $o,X10: ( $o > $o ) > $o,X11: $o > $o,X12: ( $o > $o ) > $o] :
( ( $true
!= ( X7 @ X6 ) )
& ( ( X10 @ X9 )
!= $true )
& ( ( X12 @ X6 )
!= $true )
& ( ( X12 @ X8 )
!= $true )
& ( ( X7 @ X8 )
!= $true )
& ( $true
!= ( X10 @ X8 ) )
& ( ( X0 @ X8 @ X9 )
!= $true )
& ( ( X0 @ X6 @ X11 )
!= $true )
& ( $true
!= ( X0 @ X9 @ X11 ) )
& ( ( X10 @ X6 )
= $true )
& ( $true
!= ( X0 @ X8 @ X6 ) )
& ( $true
!= ( X10 @ X11 ) )
& ( ( X0 @ X9 @ X6 )
!= $true )
& ( ( X12 @ X9 )
= $true )
& ( ( X7 @ X11 )
= $true )
& ( $true
!= ( X12 @ X11 ) )
& ( $true
!= ( X0 @ X8 @ X11 ) )
& ( ( X7 @ X9 )
!= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X1: $o > $o,X2: $o > $o] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) )
=> ( ? [X3: $o > $o,X4: ( $o > $o ) > $o,X5: $o > $o] :
( ( X0 @ X5 @ X3 )
& ~ ( X4 @ X5 )
& ( X4 @ X3 ) )
| ? [X6: $o > $o,X7: ( $o > $o ) > $o,X8: $o > $o,X9: $o > $o,X10: ( $o > $o ) > $o,X11: $o > $o,X12: ( $o > $o ) > $o] :
( ~ ( X7 @ X6 )
& ~ ( X10 @ X9 )
& ~ ( X12 @ X6 )
& ~ ( X12 @ X8 )
& ~ ( X7 @ X8 )
& ~ ( X10 @ X8 )
& ~ ( X0 @ X8 @ X9 )
& ~ ( X0 @ X6 @ X11 )
& ~ ( X0 @ X9 @ X11 )
& ( X10 @ X6 )
& ~ ( X0 @ X8 @ X6 )
& ~ ( X10 @ X11 )
& ~ ( X0 @ X9 @ X6 )
& ( X12 @ X9 )
& ( X7 @ X11 )
& ~ ( X12 @ X11 )
& ~ ( X0 @ X8 @ X11 )
& ~ ( X7 @ X9 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X1: $o > $o,X2: $o > $o] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) )
=> ( ? [X3: $o > $o,X5: ( $o > $o ) > $o,X4: $o > $o] :
( ( X0 @ X4 @ X3 )
& ~ ( X5 @ X4 )
& ( X5 @ X3 ) )
| ? [X4: $o > $o,X5: ( $o > $o ) > $o,X7: $o > $o,X6: $o > $o,X8: ( $o > $o ) > $o,X3: $o > $o,X9: ( $o > $o ) > $o] :
( ~ ( X5 @ X4 )
& ~ ( X8 @ X6 )
& ~ ( X9 @ X4 )
& ~ ( X9 @ X7 )
& ~ ( X5 @ X7 )
& ~ ( X8 @ X7 )
& ~ ( X0 @ X7 @ X6 )
& ~ ( X0 @ X4 @ X3 )
& ~ ( X0 @ X6 @ X3 )
& ( X8 @ X4 )
& ~ ( X0 @ X7 @ X4 )
& ~ ( X8 @ X3 )
& ~ ( X0 @ X6 @ X4 )
& ( X9 @ X6 )
& ( X5 @ X3 )
& ~ ( X9 @ X3 )
& ~ ( X0 @ X7 @ X3 )
& ~ ( X5 @ X6 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X1: $o > $o,X2: $o > $o] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) )
=> ( ? [X3: $o > $o,X5: ( $o > $o ) > $o,X4: $o > $o] :
( ( X0 @ X4 @ X3 )
& ~ ( X5 @ X4 )
& ( X5 @ X3 ) )
| ? [X4: $o > $o,X5: ( $o > $o ) > $o,X7: $o > $o,X6: $o > $o,X8: ( $o > $o ) > $o,X3: $o > $o,X9: ( $o > $o ) > $o] :
( ~ ( X5 @ X4 )
& ~ ( X8 @ X6 )
& ~ ( X9 @ X4 )
& ~ ( X9 @ X7 )
& ~ ( X5 @ X7 )
& ~ ( X8 @ X7 )
& ~ ( X0 @ X7 @ X6 )
& ~ ( X0 @ X4 @ X3 )
& ~ ( X0 @ X6 @ X3 )
& ( X8 @ X4 )
& ~ ( X0 @ X7 @ X4 )
& ~ ( X8 @ X3 )
& ~ ( X0 @ X6 @ X4 )
& ( X9 @ X6 )
& ( X5 @ X3 )
& ~ ( X9 @ X3 )
& ~ ( X0 @ X7 @ X3 )
& ~ ( X5 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.aC2aFuyZLa/Vampire---4.8_28987',ramsey_u_2_4_4) ).
thf(f20,plain,
! [X0: $o > $o,X1: $o > $o] :
( ( $false
= ( sK0 @ X0 @ X1 ) )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[],[f19]) ).
thf(f19,plain,
! [X0: $o > $o,X1: $o > $o] :
( ( $true != $true )
| ( $false
= ( sK0 @ X0 @ X1 ) )
| ( X0 = X1 ) ),
inference(fool_paramodulation,[],[f16]) ).
thf(f16,plain,
! [X0: $o > $o,X1: $o > $o] :
( ( $true
!= ( sK0 @ X0 @ X1 ) )
| ( X0 = X1 ) ),
inference(leibniz_equality_elimination,[],[f14]) ).
thf(f14,plain,
! [X2: ( $o > $o ) > $o,X3: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X1 @ X3 )
!= $true )
| ( ( X2 @ X3 )
!= $true )
| ( $true
= ( X2 @ X1 ) ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRA028^1 : TPTP v8.1.2. Released v3.6.0.
% 0.12/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 18:23:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.aC2aFuyZLa/Vampire---4.8_28987
% 0.14/0.38 % (29165)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.14/0.39 % (29165)Refutation not found, incomplete strategy
% 0.14/0.39 % (29165)------------------------------
% 0.14/0.39 % (29165)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (29165)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (29165)Memory used [KB]: 5500
% 0.14/0.39 % (29165)Time elapsed: 0.004 s
% 0.14/0.39 % (29165)Instructions burned: 3 (million)
% 0.14/0.39 % (29165)------------------------------
% 0.14/0.39 % (29165)------------------------------
% 0.14/0.39 % (29163)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.14/0.39 % (29166)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.14/0.39 % (29167)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.14/0.39 % (29166)Instruction limit reached!
% 0.14/0.39 % (29166)------------------------------
% 0.14/0.39 % (29166)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (29166)Termination reason: Unknown
% 0.14/0.39 % (29167)Instruction limit reached!
% 0.14/0.39 % (29167)------------------------------
% 0.14/0.39 % (29167)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (29167)Termination reason: Unknown
% 0.14/0.39 % (29167)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (29167)Memory used [KB]: 895
% 0.14/0.39 % (29167)Time elapsed: 0.003 s
% 0.14/0.39 % (29167)Instructions burned: 2 (million)
% 0.14/0.39 % (29167)------------------------------
% 0.14/0.39 % (29167)------------------------------
% 0.14/0.39 % (29166)Termination phase: Property scanning
% 0.14/0.39
% 0.14/0.39 % (29166)Memory used [KB]: 895
% 0.14/0.39 % (29166)Time elapsed: 0.003 s
% 0.14/0.39 % (29166)Instructions burned: 2 (million)
% 0.14/0.39 % (29166)------------------------------
% 0.14/0.39 % (29166)------------------------------
% 0.14/0.39 % (29168)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.14/0.39 % (29170)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.14/0.39 % (29169)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.14/0.40 % (29164)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.14/0.40 % (29170)Instruction limit reached!
% 0.14/0.40 % (29170)------------------------------
% 0.14/0.40 % (29170)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (29170)Termination reason: Unknown
% 0.14/0.40 % (29170)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (29170)Memory used [KB]: 5500
% 0.14/0.40 % (29170)Time elapsed: 0.005 s
% 0.14/0.40 % (29170)Instructions burned: 3 (million)
% 0.14/0.40 % (29170)------------------------------
% 0.14/0.40 % (29170)------------------------------
% 0.14/0.40 % (29164)Instruction limit reached!
% 0.14/0.40 % (29164)------------------------------
% 0.14/0.40 % (29164)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (29164)Termination reason: Unknown
% 0.14/0.40 % (29164)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (29164)Memory used [KB]: 5500
% 0.14/0.40 % (29164)Time elapsed: 0.005 s
% 0.14/0.40 % (29164)Instructions burned: 4 (million)
% 0.14/0.40 % (29164)------------------------------
% 0.14/0.40 % (29164)------------------------------
% 0.14/0.41 % (29169)Instruction limit reached!
% 0.14/0.41 % (29169)------------------------------
% 0.14/0.41 % (29169)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41 % (29169)Termination reason: Unknown
% 0.14/0.41 % (29169)Termination phase: Saturation
% 0.14/0.41
% 0.14/0.41 % (29169)Memory used [KB]: 5500
% 0.14/0.41 % (29169)Time elapsed: 0.017 s
% 0.14/0.41 % (29169)Instructions burned: 18 (million)
% 0.14/0.41 % (29169)------------------------------
% 0.14/0.41 % (29169)------------------------------
% 0.14/0.41 % (29171)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on Vampire---4 for (2999ds/37Mi)
% 0.14/0.41 % (29172)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on Vampire---4 for (2999ds/15Mi)
% 0.14/0.41 % (29174)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on Vampire---4 for (2999ds/1041Mi)
% 0.14/0.41 % (29173)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.14/0.42 % (29173)Instruction limit reached!
% 0.14/0.42 % (29173)------------------------------
% 0.14/0.42 % (29173)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.42 % (29173)Termination reason: Unknown
% 0.14/0.42 % (29173)Termination phase: Saturation
% 0.14/0.42
% 0.14/0.42 % (29173)Memory used [KB]: 5500
% 0.14/0.42 % (29173)Time elapsed: 0.003 s
% 0.14/0.42 % (29173)Instructions burned: 3 (million)
% 0.14/0.42 % (29173)------------------------------
% 0.14/0.42 % (29173)------------------------------
% 0.14/0.42 % (29175)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on Vampire---4 for (2999ds/7Mi)
% 0.14/0.42 % (29172)Instruction limit reached!
% 0.14/0.42 % (29172)------------------------------
% 0.14/0.42 % (29172)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.42 % (29172)Termination reason: Unknown
% 0.14/0.42 % (29172)Termination phase: Saturation
% 0.14/0.42
% 0.14/0.42 % (29172)Memory used [KB]: 5500
% 0.14/0.42 % (29172)Time elapsed: 0.009 s
% 0.14/0.42 % (29172)Instructions burned: 16 (million)
% 0.14/0.42 % (29172)------------------------------
% 0.14/0.42 % (29172)------------------------------
% 0.14/0.42 % (29175)Instruction limit reached!
% 0.14/0.42 % (29175)------------------------------
% 0.14/0.42 % (29175)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.42 % (29175)Termination reason: Unknown
% 0.14/0.42 % (29175)Termination phase: Saturation
% 0.14/0.42
% 0.14/0.42 % (29175)Memory used [KB]: 1023
% 0.14/0.42 % (29175)Time elapsed: 0.006 s
% 0.14/0.42 % (29175)Instructions burned: 8 (million)
% 0.14/0.42 % (29175)------------------------------
% 0.14/0.42 % (29175)------------------------------
% 0.22/0.43 % (29171)Instruction limit reached!
% 0.22/0.43 % (29171)------------------------------
% 0.22/0.43 % (29171)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.43 % (29171)Termination reason: Unknown
% 0.22/0.43 % (29171)Termination phase: Saturation
% 0.22/0.43
% 0.22/0.43 % (29171)Memory used [KB]: 5628
% 0.22/0.43 % (29171)Time elapsed: 0.019 s
% 0.22/0.43 % (29171)Instructions burned: 37 (million)
% 0.22/0.43 % (29171)------------------------------
% 0.22/0.43 % (29171)------------------------------
% 0.22/0.43 % (29177)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.22/0.43 % (29176)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on Vampire---4 for (2999ds/16Mi)
% 0.22/0.43 % (29177)Instruction limit reached!
% 0.22/0.43 % (29177)------------------------------
% 0.22/0.43 % (29177)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.43 % (29177)Termination reason: Unknown
% 0.22/0.43 % (29177)Termination phase: Saturation
% 0.22/0.43
% 0.22/0.43 % (29177)Memory used [KB]: 5500
% 0.22/0.43 % (29177)Time elapsed: 0.004 s
% 0.22/0.43 % (29177)Instructions burned: 4 (million)
% 0.22/0.43 % (29177)------------------------------
% 0.22/0.43 % (29177)------------------------------
% 0.22/0.43 % (29178)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.22/0.44 % (29178)Instruction limit reached!
% 0.22/0.44 % (29178)------------------------------
% 0.22/0.44 % (29178)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (29178)Termination reason: Unknown
% 0.22/0.44 % (29178)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (29178)Memory used [KB]: 1023
% 0.22/0.44 % (29178)Time elapsed: 0.004 s
% 0.22/0.44 % (29178)Instructions burned: 4 (million)
% 0.22/0.44 % (29178)------------------------------
% 0.22/0.44 % (29178)------------------------------
% 0.22/0.44 % (29179)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on Vampire---4 for (2999ds/7Mi)
% 0.22/0.44 % (29176)Instruction limit reached!
% 0.22/0.44 % (29176)------------------------------
% 0.22/0.44 % (29176)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (29176)Termination reason: Unknown
% 0.22/0.44 % (29176)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (29176)Memory used [KB]: 5628
% 0.22/0.44 % (29176)Time elapsed: 0.009 s
% 0.22/0.44 % (29176)Instructions burned: 17 (million)
% 0.22/0.44 % (29176)------------------------------
% 0.22/0.44 % (29176)------------------------------
% 0.22/0.44 % (29179)Instruction limit reached!
% 0.22/0.44 % (29179)------------------------------
% 0.22/0.44 % (29179)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (29179)Termination reason: Unknown
% 0.22/0.44 % (29179)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (29179)Memory used [KB]: 5500
% 0.22/0.44 % (29179)Time elapsed: 0.006 s
% 0.22/0.44 % (29179)Instructions burned: 8 (million)
% 0.22/0.44 % (29179)------------------------------
% 0.22/0.44 % (29179)------------------------------
% 0.22/0.44 % (29180)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.22/0.44 % (29180)Instruction limit reached!
% 0.22/0.44 % (29180)------------------------------
% 0.22/0.44 % (29180)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.44 % (29180)Termination reason: Unknown
% 0.22/0.44 % (29180)Termination phase: Saturation
% 0.22/0.44
% 0.22/0.44 % (29180)Memory used [KB]: 5500
% 0.22/0.44 % (29180)Time elapsed: 0.003 s
% 0.22/0.44 % (29180)Instructions burned: 3 (million)
% 0.22/0.44 % (29180)------------------------------
% 0.22/0.44 % (29180)------------------------------
% 0.22/0.45 % (29182)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.22/0.45 % (29181)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.22/0.45 % (29181)Instruction limit reached!
% 0.22/0.45 % (29181)------------------------------
% 0.22/0.45 % (29181)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.45 % (29181)Termination reason: Unknown
% 0.22/0.45 % (29181)Termination phase: Saturation
% 0.22/0.45
% 0.22/0.45 % (29181)Memory used [KB]: 5500
% 0.22/0.45 % (29181)Time elapsed: 0.004 s
% 0.22/0.45 % (29181)Instructions burned: 4 (million)
% 0.22/0.45 % (29181)------------------------------
% 0.22/0.45 % (29181)------------------------------
% 0.22/0.46 % (29182)Instruction limit reached!
% 0.22/0.46 % (29182)------------------------------
% 0.22/0.46 % (29182)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.46 % (29182)Termination reason: Unknown
% 0.22/0.46 % (29182)Termination phase: Saturation
% 0.22/0.46
% 0.22/0.46 % (29182)Memory used [KB]: 5500
% 0.22/0.46 % (29182)Time elapsed: 0.009 s
% 0.22/0.46 % (29182)Instructions burned: 18 (million)
% 0.22/0.46 % (29182)------------------------------
% 0.22/0.46 % (29182)------------------------------
% 0.22/0.46 % (29183)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on Vampire---4 for (2999ds/710Mi)
% 0.22/0.46 % (29185)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on Vampire---4 for (2999ds/902Mi)
% 0.22/0.46 % (29184)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on Vampire---4 for (2999ds/6Mi)
% 0.22/0.46 % (29184)Instruction limit reached!
% 0.22/0.46 % (29184)------------------------------
% 0.22/0.46 % (29184)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.46 % (29184)Termination reason: Unknown
% 0.22/0.46 % (29184)Termination phase: Saturation
% 0.22/0.46
% 0.22/0.46 % (29184)Memory used [KB]: 5500
% 0.22/0.46 % (29184)Time elapsed: 0.026 s
% 0.22/0.46 % (29184)Instructions burned: 7 (million)
% 0.22/0.46 % (29184)------------------------------
% 0.22/0.46 % (29184)------------------------------
% 0.22/0.47 % (29186)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on Vampire---4 for (2999ds/21Mi)
% 0.22/0.47 % (29188)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on Vampire---4 for (2999ds/6Mi)
% 0.22/0.47 % (29187)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on Vampire---4 for (2999ds/5Mi)
% 0.22/0.47 % (29186)Instruction limit reached!
% 0.22/0.47 % (29186)------------------------------
% 0.22/0.47 % (29186)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.47 % (29188)Instruction limit reached!
% 0.22/0.47 % (29188)------------------------------
% 0.22/0.47 % (29188)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.47 % (29186)Termination reason: Unknown
% 0.22/0.47 % (29186)Termination phase: Saturation
% 0.22/0.47
% 0.22/0.47 % (29186)Memory used [KB]: 5628
% 0.22/0.47 % (29186)Time elapsed: 0.010 s
% 0.22/0.47 % (29186)Instructions burned: 22 (million)
% 0.22/0.47 % (29186)------------------------------
% 0.22/0.47 % (29186)------------------------------
% 0.22/0.47 % (29188)Termination reason: Unknown
% 0.22/0.47 % (29188)Termination phase: Saturation
% 0.22/0.47
% 0.22/0.47 % (29188)Memory used [KB]: 5500
% 0.22/0.47 % (29188)Time elapsed: 0.003 s
% 0.22/0.47 % (29188)Instructions burned: 7 (million)
% 0.22/0.47 % (29188)------------------------------
% 0.22/0.47 % (29188)------------------------------
% 0.22/0.48 % (29187)Instruction limit reached!
% 0.22/0.48 % (29187)------------------------------
% 0.22/0.48 % (29187)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.48 % (29187)Termination reason: Unknown
% 0.22/0.48 % (29187)Termination phase: Saturation
% 0.22/0.48
% 0.22/0.48 % (29187)Memory used [KB]: 5500
% 0.22/0.48 % (29187)Time elapsed: 0.005 s
% 0.22/0.48 % (29187)Instructions burned: 6 (million)
% 0.22/0.48 % (29187)------------------------------
% 0.22/0.48 % (29187)------------------------------
% 0.22/0.48 % (29189)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on Vampire---4 for (2999ds/377Mi)
% 0.22/0.48 % (29190)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on Vampire---4 for (2999ds/779Mi)
% 0.22/0.49 % (29163)Instruction limit reached!
% 0.22/0.49 % (29163)------------------------------
% 0.22/0.49 % (29163)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.49 % (29163)Termination reason: Unknown
% 0.22/0.49 % (29163)Termination phase: Saturation
% 0.22/0.49
% 0.22/0.49 % (29163)Memory used [KB]: 5628
% 0.22/0.49 % (29163)Time elapsed: 0.103 s
% 0.22/0.49 % (29163)Instructions burned: 184 (million)
% 0.22/0.49 % (29163)------------------------------
% 0.22/0.49 % (29163)------------------------------
% 0.22/0.49 % (29191)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on Vampire---4 for (2999ds/19Mi)
% 0.22/0.50 % (29191)Instruction limit reached!
% 0.22/0.50 % (29191)------------------------------
% 0.22/0.50 % (29191)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.50 % (29191)Termination reason: Unknown
% 0.22/0.50 % (29191)Termination phase: Saturation
% 0.22/0.50
% 0.22/0.50 % (29191)Memory used [KB]: 5628
% 0.22/0.50 % (29191)Time elapsed: 0.011 s
% 0.22/0.50 % (29191)Instructions burned: 20 (million)
% 0.22/0.50 % (29191)------------------------------
% 0.22/0.50 % (29191)------------------------------
% 0.22/0.51 % (29192)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on Vampire---4 for (2998ds/879Mi)
% 0.22/0.52 % (29193)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on Vampire---4 for (2998ds/17Mi)
% 0.22/0.52 % (29168)Instruction limit reached!
% 0.22/0.52 % (29168)------------------------------
% 0.22/0.52 % (29168)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.52 % (29168)Termination reason: Unknown
% 0.22/0.52 % (29168)Termination phase: Saturation
% 0.22/0.52
% 0.22/0.52 % (29168)Memory used [KB]: 5628
% 0.22/0.52 % (29168)Time elapsed: 0.128 s
% 0.22/0.52 % (29168)Instructions burned: 276 (million)
% 0.22/0.52 % (29168)------------------------------
% 0.22/0.52 % (29168)------------------------------
% 0.22/0.53 % (29193)Instruction limit reached!
% 0.22/0.53 % (29193)------------------------------
% 0.22/0.53 % (29193)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.53 % (29193)Termination reason: Unknown
% 0.22/0.53 % (29193)Termination phase: Saturation
% 0.22/0.53
% 0.22/0.53 % (29193)Memory used [KB]: 5628
% 0.22/0.53 % (29193)Time elapsed: 0.032 s
% 0.22/0.53 % (29193)Instructions burned: 17 (million)
% 0.22/0.53 % (29193)------------------------------
% 0.22/0.53 % (29193)------------------------------
% 0.22/0.54 % (29194)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2998ds/3Mi)
% 0.22/0.54 % (29194)Instruction limit reached!
% 0.22/0.54 % (29194)------------------------------
% 0.22/0.54 % (29194)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.54 % (29194)Termination reason: Unknown
% 0.22/0.54 % (29194)Termination phase: Saturation
% 0.22/0.54
% 0.22/0.54 % (29194)Memory used [KB]: 1023
% 0.22/0.54 % (29194)Time elapsed: 0.004 s
% 0.22/0.54 % (29194)Instructions burned: 4 (million)
% 0.22/0.54 % (29194)------------------------------
% 0.22/0.54 % (29194)------------------------------
% 0.22/0.54 % (29195)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on Vampire---4 for (2998ds/30Mi)
% 0.22/0.56 % (29195)Instruction limit reached!
% 0.22/0.56 % (29195)------------------------------
% 0.22/0.56 % (29195)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.56 % (29195)Termination reason: Unknown
% 0.22/0.56 % (29195)Termination phase: Saturation
% 0.22/0.56
% 0.22/0.56 % (29195)Memory used [KB]: 5500
% 0.22/0.56 % (29195)Time elapsed: 0.016 s
% 0.22/0.56 % (29195)Instructions burned: 30 (million)
% 0.22/0.56 % (29195)------------------------------
% 0.22/0.56 % (29195)------------------------------
% 1.64/0.57 % (29196)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on Vampire---4 for (2998ds/127Mi)
% 1.64/0.57 % (29189)First to succeed.
% 1.64/0.57 % (29189)Refutation found. Thanks to Tanya!
% 1.64/0.57 % SZS status Theorem for Vampire---4
% 1.64/0.57 % SZS output start Proof for Vampire---4
% See solution above
% 1.64/0.57 % (29189)------------------------------
% 1.64/0.57 % (29189)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.64/0.57 % (29189)Termination reason: Refutation
% 1.64/0.57
% 1.64/0.57 % (29189)Memory used [KB]: 5884
% 1.64/0.57 % (29189)Time elapsed: 0.088 s
% 1.64/0.57 % (29189)Instructions burned: 241 (million)
% 1.64/0.57 % (29189)------------------------------
% 1.64/0.57 % (29189)------------------------------
% 1.64/0.57 % (29162)Success in time 0.193 s
% 1.64/0.57 % Vampire---4.8 exiting
%------------------------------------------------------------------------------